Distributing Tokens on a Hypercube without Error Accumulation
نویسندگان
چکیده
The problem of load balancing on the hypercube is considered. A number of tokens are placed at the nodes and the goal is to redistribute them evenly throughout the network. Initially each of the p nodes stores up to m tokens. A simple algorithm is presented operating in time O(logp+m log logp) on average.
منابع مشابه
Efficient Token Clustering on Hypercubes
We study a combinatorial problem, called token clustering, on a hypercube: given N colored tokens (k tokens per color) each one placed on one processor of the N-node hypercube, cluster all the tokens with the same color into the same k-node subcube. This problem has natural applications in several areas. We propose a distributed algorithm to solve the clustering problem on hypercubes and show s...
متن کاملBlack Hole Search with Tokens in Interconnected Networks
We study the Black Hole search problem using mobile agents in three interconnected network topologies: hypercube, torus and complete network. We do so without relying on local storage. Instead we use a less-demanding and less-expensive token mechanism. We demonstrate that the Black Hole can be located with a minimum of two (2) co-located agents performing Θ(n) moves with O(1) tokens, in each of...
متن کاملPairwise Key Establishment Scheme for Hypercube-based Wireless Sensor Networks
-When designing wireless sensor networks, the process of establishing and distributing the secret keys securely and efficiently is very challenging due to the unpredictable network topology. Recently, hypercube virtual backbone approach has been used to provide efficient data gathering schemes for the wireless sensor networks. The hypercube attractive structure and topological properties provid...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملTowards Super-scalable Multicast
Large-Scale multicast applications for the Internet require the availability of multicast protocols that can support multicast groups with many thousand simultaneous members. For this it is crucial that there exist mechanisms to e ciently exchange control information between the members of a group. In this paper, we present a new approach for distributing control information within a multicast ...
متن کامل